Starvation-free mutual exclusion with semaphores

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

متن کامل

A Starvation-Free Solution to the Mutual Exclusion Problem

With three or more cyclic processes competing for the critical section, however, there is a danger of individual starvation when the Pand V-operations are so-called ‘weakly implemented’. When the semaphore operations are weakly implemented and a V(m) is executed, which process is allowed to proceed is left undefined when two or more processes are blocked by P(m). .As a result, there is a danger...

متن کامل

A fair starvation-free prioritized mutual exclusion algorithm for distributed systems

Several distributed mutual exclusion algorithms define the order in which requests are satisfied based on the priorities assigned to requests. These algorithms are very useful for real-time applications ones or those where priority is associated to a quality of service requirement. However, priority based strategies may result in starvation problems where high priority requests forever prevent ...

متن کامل

An Efficient Solution to the Mutual Exclusion Problem Using Weak Semaphores

We present a simple solution to the mutual exclusion problem with no lockout that uses weak binary semaphores. Previously, Morris [4] presented a solution to this problem that uses three binary semaphores and two variable-size shared variables. A simpler solution was given in [5], where just two semaphores and two shared singlebit variables are used. (In some earlier versions, an incorrect one-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Formal Aspects of Computing

سال: 2011

ISSN: 0934-5043,1433-299X

DOI: 10.1007/s00165-011-0219-y